#define _CRT_SECURE_NO_WARNINGS 1

#include"BinaryTree.h"
#include"queue.h"

int main()
{
	BTNode* A = CreateTreeNode('A');
	BTNode* B = CreateTreeNode('B');
	BTNode* C = CreateTreeNode('C');
	BTNode* D = CreateTreeNode('D');
	BTNode* E = CreateTreeNode('E');
	//BTNode* F = CreateTreeNode('F');
	BTNode* G = CreateTreeNode('G');

	A->left = B;
	A->right = C;
	B->left = D;
	B->right = E;
	//C->left = F;
	C->right = G;

	//PrevOrder(A);
	//printf("\n\n");
	//InOrder(A);
	//printf("\n\n");
	//PostOrder(A);

	//int size = 0;
	//TreeSize(A, &size);
	//printf("%d\n",size);
 //   size = 0;
	//TreeSize(A, &size);
	//printf("%d\n", size);

	printf("%d\n", TreeLeafSize(A));
	printf("%d\n", TreeLeafSize(A));

	printf("%d\n", TreeKlevelSize(A,3));

	//printf("%p\n", F);
	//printf("%p\n",TreeFind(A,'F'));
	
	TreeLevelOrder(A);

	printf("%d\n", BinaryTreeComplete(A));
	
	BinaryTreeDestory(A);
	A = NULL;
	return 0;
}











